Shared variables in CSP
نویسندگان
چکیده
The algebra of Communicating Sequential Processes provides a facility to formal specify systems by describing their behavior. To be able do denote these systems more precisely it is useful to introduce state variables. Because the CSP algebra deals with concurrent processes, the state variables are shared between those processes. This contribution describes techniques how to represent shared variables in CSP utilizing common features of CSP without any extension to the algebra.
منابع مشابه
A UTP Semantics for Communicating Processes with Shared Variables
CSP# (Communicating Sequential Programs) is a modelling language designed for specifying concurrent systems by integrating CSP-like compositional operators with sequential programs updating shared variables. In this paper, we define an observation-oriented denotational semantics in an open environment for the CSP# language based on the UTP framework. To deal with shared variables, we lift tradi...
متن کاملCompiling shared variable programs into CSP
We present a compiler from a simple shared variable language into CSP. This allows the application of CSP-based tools such as FDR when analysing programs written in the other language. The translation into CSP makes it easy to be flexible about the semantics of execution, most particularly the amount of atomicity that is enforced. We examine ways available to translate specifications we may wis...
متن کاملMUSE CSP : An Extension to the Constraint Satisfaction
This paper describes an extension to the constraint satisfaction problem (CSP) called MUSE CSP (MU ltiply SEgmented C onstraint Satisfaction Problem). This extension is especially useful for those problems which segment into multiple sets of partially shared variables. Such problems arise naturally in signal processing applications including computer vision, speech processing, and handwriting r...
متن کاملMUSE CSP : An Extension to the Constraint SatisfactionProblemRandall
This paper describes an extension to the constraint satisfaction problem (CSP) called MUSE CSP (MU ltiply SEgmented C onstraint Satisfaction Problem). This extension is especially useful for those problems which segment into multiple sets of partially shared variables. Such problems arise naturally in signal processing applications including computer vision, speech processing, and handwriting r...
متن کاملMUSE CSP: An Extension to the Constraint Satisfaction Problem
This paper describes an extension to the constraint satisfaction problem (CSP) called MUSE CSP (MU ltiply SEgmented Constraint Satisfaction Problem). This extension is especially useful for those problems which segment into multiple sets of partially shared variables. Such problems arise naturally in signal processing applications including computer vision, speech processing, and handwriting re...
متن کامل